Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2010, Vol. 33 ›› Issue (1): 97-101.doi: 10.13190/jbupt.201001.97.wanggj

• Reports • Previous Articles     Next Articles

Polynomial Circuits Optimization through Arithmetic Transformation over Finite Field

WANG Guan-jun   

  1. (College of Computer Science and Technology,China University of Mining and Technology, Jiangsu Xuzhou 221116, China)
  • Received:2008-12-10 Revised:2009-10-28 Online:2010-02-28 Published:2010-02-28
  • Contact: WANG Guan-jun

Abstract:

Specifically for challenge to the power dissipation and area during high-level synthesis in electronic design automation(EDA), An imprecise arithmetic automation synthesis and optimization approach is proposed, the word-length optimization are based on finite field characteristic. The imprecise polynomial circuit optimization is based on arithmetic transformation method, which considering the fixed point and floating point representation condition first, then a realization of circuits under different accuracy boundary is given, the power dissipation and area error is traded off, which applying branch and bound method to find the solution with minimal cost, to determine the minimal word length which satisfies the error bound, making use of the automation synthesis approach to get ultimate optimize structure at the same time. The experiment results demonstrate power dissipation and area got a 35% and 20% reduction respectively by increasing 05%~1% round off error.

Key words: finite field, imprecise arithmetic circuits, arithmetic transformation, error bound